Information hiding using matroid theory

Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol transmit secret without revealing it external observers. This is question of how large linear code can be, when required agree with prescribed on collection coordinate sets. We show efficiency such determined derived matroid underlying code. Furthermore, provide several sufficient combinatorial conditions for no transmission possible.